منابع مشابه
Generalized Additive Bayesian Network Classifiers
Bayesian network classifiers (BNC) have received considerable attention in machine learning field. Some special structure BNCs have been proposed and demonstrate promise performance. However, recent researches show that structure learning in BNs may lead to a non-negligible posterior problem, i.e, there might be many structures have similar posterior scores. In this paper, we propose a generali...
متن کاملGeneralized network design problems
Network design problems consist of identifying an optimal subgraph of a graph, subject to side constraints. In generalized network design problems, the vertex set is partitioned into clusters and the feasibility conditions are expressed in terms of the clusters. Several applications of generalized network design problems arise in the fields of telecommunications, transportation and biology. The...
متن کاملGeneralized network design polyhedra
In recent years, there has been an increased literature on so-called generalized network design problems (GNDPs), such as the generalized minimum spanning tree problem and the generalized traveling salesman problem. In a GNDP, the node set of a graph is partitioned into “clusters,” and the feasible solutions must contain one node from each cluster. Up to now, the polyhedra associated with diffe...
متن کاملGeneral Design Bayesian Generalized Linear Mixed Models
Linear mixed models are able to handle an extraordinary range of complications in regression-type analyses. Their most common use is to account for within-subject correlation in longitudinal data analysis. They are also the standard vehicle for smoothing spatial count data. However, when treated in full generality, mixed models can also handle spline-type smoothing and closely approximate krigi...
متن کاملHybrid Metaheuristics for Generalized Network Design Problems
In this thesis, we consider several generalized network design problems (NDPs) which belong to the family of NP-hard combinatorial optimization problems. In contrast to classical NDPs, the generalized versions are defined on graphs whose node sets are partitioned into clusters. The goal is to find a subgraph which spans exactly one node from each cluster and also meets further constraints respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.07.010